Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem
نویسندگان
چکیده
منابع مشابه
Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem
We will apply some algebraic results, namely Hilbert's basis theorem and Grr obner bases, to get a diierent technique for proving decidability of strong bisimulation of basic parallel processes.
متن کاملDecidability of Bisimulation Equivalence for Pushdown Processes
We show that bisimulation equivalence is decidable for pushdown automata without ǫ-transitions.
متن کاملOn the Complexity of Bisimulation Problems for Basic Parallel Processes
Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has non-elementary complexity [7]. On the other hand, no lower bound for the problem was known. We show that strong bisimilarity of BPP is co-NP-hard. Weak bisimilarity of BPP is not known to be decidable, but an NP lower bound has been shown in [31]. We improve this result by showing that weak bisi...
متن کاملNon-interleaving bisimulation equivalences on Basic Parallel Processes
We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n logn)) and history preserving bisimilarity (in O(n)) on the class Basic Parallel Processes. The latter algorithm also decides a number of other non-interleaving behavioural equivalences (e.g., distributed bisimilarity) which are known to coincide with history preserving bisimilarity on this class....
متن کاملWeak Bisimulation and Model Checking for Basic Parallel Processes
Basic Parallel Processes (BPP) are a natural subclass of CCS innnite-state processes. They are also equivalent to a special class of Petri nets. We show that unlike for general Petri nets, it is decidable if a BPP and a nite-state system are weakly bisimilar. To the best of our knowledge, this is the rst decidability result for weak bisimulation and a non-trivial class of innnite-state systems....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1997
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80431-1